Application of Area Predicted TCG Algorithm in Floorplanning with Boundary Constraint

Floorplanning determines the positions of blocks on a chip subject to various objectives. In practical physical design, on the requirement of placing some blocks along the boundaries of the chip such as the blocks can be connected to I/O pads, the floorplanning with boundary constraint is raised. In this paper, we apply a floorplanning algorithm named area predicted transitive closure graphs (AP-TCG) to solve the problem. We integrate the feasible conditions of boundary constraints into the perturbations and guarantee the intermediate solution is feasible. Experimental result shows that our approach can obtain high quality results in floorplanning with boundary constraints efficiently.